An Enumerative Geometry for Magic and Magilatin Labellings

A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum, the magic sum. Examples are magic squares (the sets are the rows, columns, and diagonals) and semimagic squares (the same, but without the diagonals). A magilatin labelling is like a magic labelling but the values need be distinct only within each set. We show that the number of n × n magic or magilatin labellings is a quasipolynomial function of the magic sum, and also of an upper bound on the entries in the square. Our results differ from previous ones because we require that the entries in the square all be different from each other, and because we derive our results not by ad hoc reasoning but from a general theory of counting lattice points in rational inside-out polytopes. We also generalize from set systems to rational linear forms. Dedicated to the memory of Claudia Zaslavsky, 1917–2006 Received August 10, 2005     

Elektrische Charakterisierung von Hochfrequenz-Niederdruck-Gasentladungen

In recent years there has emerged significant interest in low pressure radio frequency (rf) glow discharges which are used widely particulary in IC fabrication. Various parameters of the rf glow discharge have been found to be useful for its electrical characterization; however, there is no uniformity and agreement. Extensive experimental investigations on various discharge systems have shown, that the self-bias on the rf driven electrode, the complex conductivity and the breakdown characteristic are preferable parameters of rf discharges. Advantageously the self-bias and the complex conductivity should be presented in dependence on the pressure and the applied rf voltage. The discharge current cannot be measured quite accurately due to currents via leaky capacitors and the deviations from a sinusoidal form of the current due to nonlinearities.     

On Lattices of Uniformities

We study lattice theoretical properties of lattices of uniformities such as modularity, distributive laws and the existence of (relative) complements. For this the concepts of permutable uniformities (see Definition 3.1) and independent uniformities (see Definition 4.1) are important. Moreover, we show that e.g. the lattice of all lattice uniformities on a lattice L is a closed sublattice of the lattice of all uniformities on L.     

Romanovski polynomials in selected physics problems

We briefly review the five possible real polynomial solutions of hypergeometric differential equations. Three of them are the well known classical orthogonal polynomials, but the other two are different with respect to their orthogonality properties. We then focus on the family of polynomials which exhibits a finite orthogonality. This family, to be referred to as the Romanovski polynomials, is required in exact solutions of several physics problems ranging from quantum mechanics and quark physics to random matrix theory. It appears timely to draw attention to it by the present study. Our survey also includes several new observations on the orthogonality properties of the Romanovski polynomials and new developments from their Rodrigues formula.     

Some examples of application of the metric entropy method

We show how the metric entropy method can be substituted for the dyadic chaining, to prove in a unified setting several classical results. Among them are Stechkin's theorem, Gál--Koksma theorems and quantitative Borel--Cantelli lemmas. We give simpler proofs and improve some of these results. Two classes of examples are given: firstly stationary Gaussian sequences with applications to upper and lower classes and the law of the iterated logarithm for subsequences, and secondly in Diophantine approximation relatively to Gál and Schmidt's theorems.     

A parallel version of the preconditioned conjugate gradient method for boundary element equations

The parallel version of precondition techniques is developed for matrices arising from the Galerkin boundary element method for two-dimensional domains with Dirichlet boundary conditions. Results were obtained for implementations on a transputer network as well as on an nCUBE-2 parallel computer showing that iterative solution methods are very well suited for a MIMD computer. A comparison of numerical results for iterative and direct solution methods is presented and underlines the superiority of iterative methods for large systems.     

Investigation of the stability of metal species with respect to liquid chromatographic separations

Summary For accurate speciation analyses it is important to know the stability of the respective species, especially in the case of metal complexes. Factors affecting the chromatographic stability of such metal species are investigated. By using thermodynamic models for complex formation and chromatographic retention equilibria the influence of species concentration, stoichiometry and excess of ligand is calculated and compared with experimental results for iron complexes (lactate, gluconate and citrate species). Iron citrate is the only species, that is chromatographed as 1:2 complex (metal: ligand), while iron lactate and gluconate are transformed to 1:1 species. Problems resulting from the coelution of different species are discussed.Dedicated to Professor Dr. Wilhelm Fresenius on the occasion of his 80th birthday